منابع مشابه
On partitioning of hypergraphs
We study Edge-Isoperimetric Problems (EIP) for hypergraphs and extend some technique in this area from graphs to hypergraphs. In particular, we establish some new results on a relationship between the EIP and some extremal poset problems, and apply them to obtain an exact solution of the EIP for certain hypergraph families. We also show how to solve the EIP on hypergraphs in some cases when the...
متن کاملPartitioning 3-uniform hypergraphs
Bollobás and Thomason conjectured that the vertices of any r-uniform hypergraph with m edges can be partitioned into r sets so that each set meets at least rm/(2r − 1) edges. For r = 3, Bollobás, Reed and Thomason proved the lower bound (1− 1/e)m/3 ≈ 0.21m, which was improved to 5m/9 by Bollobás and Scott (while the conjectured bound is 3m/5). In this paper, we show that this Bollobás-Thomason ...
متن کاملTransversal Partitioning in Balanced Hypergraphs
A transversal of a hypergraph is a set of vertices meeting all the hyperedges. A k-fold transversal of a hypergraph is a set of vertices such that every hyperedge has at least k elements of. In this paper, we prove that a k-fold transversal of a balanced hypergraph can be expressed as a union of k pairwise disjoint transversals and such partition can be obtained in polynomial time. We give an N...
متن کاملReplicated partitioning for undirected hypergraphs
Hypergraph partitioning (HP) and replication are diverse but powerful tools that are traditionally applied separately to minimize the costs of parallel and sequential systems that access related data or process related tasks. When combined together, these two techniques have the potential of achieving significant improvements in performance of many applications. In this study, we provide an app...
متن کاملPartitioning problems in dense hypergraphs
We study the general partitioning problem and the discrepancy problem in dense hypergraphs. Using the regularity lemma [16] and its algorithmic version proved in [5], we give polynomial time approximation schemes for the general partitioning problem and for the discrepancy problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.09.022